The secure time-dependent vehicle routing problem with uncertain demands

This paper addresses the transportation of valuable goods in which security carriers are interested to optimize operating costs and vehicle routes’ security. In real operations, route planning scheduling normally performed manually based on individual experience. Hereupon, an optimizing approach should be developed target robbery risk reduction distribution network’ operational costs. Facing dangerous nature some considerations play important role, including demand fluctuations traffic congestion urban environment. To handle these issues, we respectively benefit from robust optimization theory considering time-dependent travel speeds with satisfying “first-in-first-out” property. proposes a rich routing problem denoted by secure time windows pickup delivery uncertain demands (S-TD-VRPTWPD-UD). A mathematical formulation efficient solution combining greedy randomized adaptive search procedure (GRASP) iterated local (ILS) minimize predictability plans using integrated index, besides Extensive computational experiments this analyze impact uncertainty speed time-dependency show efficiency GRASP×ILS implementation. The results significant improvements due as well extra cost protecting model against worst-case scenario requests deriving counterpart S-TD-VRPTWPD-UD.